Random Walks on Stochastic Temporal Networks
نویسندگان
چکیده
In the study of dynamical processes on networks, there has been intense focus on network structure—i.e., the arrangement of edges and their associated weights—but the effects of the temporal patterns of edges remains poorly understood. In this chapter, we develop a mathematical framework for random walks on temporal networks using an approach that provides a compromise between abstract but unrealistic models and data-driven but non-mathematical approaches. To do this, we introduce a stochastic model for temporal networks in which we summarize the temporal and structural organization of a system using a matrix of waiting-time distributions. We show that random walks on stochastic temporal networks can be described exactly by an integro-differential master equation and derive an analytical expression for its asymptotic steady state. We also discuss how our work might be useful to help build centrality measures for temporal networks.
منابع مشابه
Steady state and mean recurrence time for random walks on stochastic temporal networks
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of random walks on temporal networks. Here we theoretically study two types of event-driven random walks on a stochastic temporal network model that produces arb...
متن کاملSlow relaxation dynamics and aging in random walks on activity driven temporal networks
We investigate the dynamic relaxation of random walks on temporal networks by focusing in the recently proposed activity driven model [Perra et al. Sci. Rep. srep00469 (2012)]. For realistic activity distributions with a power-law form, we observe the presence of a very slow relaxation dynamics compatible with aging effects. A theoretical description of this processes in achieved by means of a ...
متن کاملLévy random walks on multiplex networks
Random walks constitute a fundamental mechanism for many dynamics taking place on complex networks. Besides, as a more realistic description of our society, multiplex networks have been receiving a growing interest, as well as the dynamical processes that occur on top of them. Here, inspired by one specific model of random walks that seems to be ubiquitous across many scientific fields, the Lév...
متن کاملDoubly Stochastic Converge: Uniform Sampling for Directed P2P Networks
Uniformly sampling nodes from deployed peer-to-peer (P2P) networks has proven to be a difficult problem, as current techniques suffer from sample bias and limited applicability. A sampling service which randomly samples nodes from a uniform distribution across all members of a network offers a platform on which it is easy to construct unstructured search, data replication, and monitoring algori...
متن کاملRandom walks in peer-to-peer networks: Algorithms and evaluation
We quantify the effectiveness of random walks for searching and construction of unstructured peer-to-peer (P2P) networks. We have identified two cases where the use of random walks for searching achieves better results than flooding: (a) when the overlay topology is clustered, and (b) when a client re-issues the same query while its horizon does not change much. Related to the simulation of ran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1306.0715 شماره
صفحات -
تاریخ انتشار 2013